Subcritical Graph Classes Containing All Planar Graphs
نویسندگان
چکیده
منابع مشابه
Asymptotic Study of Subcritical Graph Classes
We present a unified general method for the asymptotic study of graphs from the so-called “subcritical” graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works both in the labelled and unlabelled framework. The main results concern the asymptotic enumeration and the limit laws of properties of random graphs chosen from ...
متن کاملSubgraph statistics in subcritical graph classes
Let H be a fixed graph and G a subcritical graph class. In this paper we show that the number of occurrences of H (as a subgraph) in a uniformly at random graph of size n in G follows a normal limiting distribution with linear expectation and variance. The main ingredient in our proof is the analytic framework developed by Drmota, Gittenberger and Morgenbesser to deal with infinite systems of f...
متن کاملThe Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes
The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Chvátal studied this problem under the name of the Decomposable Graph Recognition problem, and proved the problem to be NP-complete for graphs with maximum degree 4, and gave a polynomial algorithm for graphs with maximum degree 3. Recently, unaware of Chvátal’s result, Patrignani and Pizz...
متن کاملPlanar Graph Characterization - Using γ - Stable Graphs
A graph G is said to be γ stable if γ(Gxy) = γ(G), for all x, y ∈ V (G), x is not adjacent to y, where Gxy denotes the graph obtained by merging the vertices x, y. In this paper we have provided a necessary and sufficient condition for Ḡ to be γ stable, where Ḡ denotes the complement of G. We have obtained a characterization of planar graphs when G and Ḡ are γ stable graphs. Key–Words: γ stable...
متن کاملMapping planar graphs into the Coxeter graph
We conjecture that every planar graph of odd-girth at least 11 admits a homomorphism to the Coxeter graph. Supporting this conjecture, we prove that every planar graph of odd-girth at least 17 admits a homomorphism to the Coxeter graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2018
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548318000056